Compressing Rank-Structured Matrices via Randomized Sampling
نویسندگان
چکیده
منابع مشابه
Compressing Rank-Structured Matrices via Randomized Sampling
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient but have off-diagonal blocks that are—specifically, the classes of so-called hierarchically off-diagonal low rank (HODL...
متن کاملRapid factorization of structured matrices via randomized sampling
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rankdeficient, but have off-diagonal blocks that are. Such matrices arise ...
متن کاملUnitary rank structured matrices
In this paper we describe how one can represent a unitary rank structured matrix in an efficient way as a product of unitary or Givens transformations. We provide also some basic operations for manipulating the representation, such as the transition to zerocreating form, the transition to a unitary/Givens-weight representation, as well as an internal pull-through process of the two branches of ...
متن کاملMfrs: an Algorithm for the Structured Multifrontal Solution of Large Sparse Matrices via Randomized Sampling
This paper presents strategies for the development of an efficient algorithm (MFRS) for the direct solutions of large sparse linear systems. The algorithm is based on a structured multifrontal method with randomized sampling. We propose data structures and access schemes for a type of rank structured matrices, called Hierarchically SemiSeparable (HSS) forms. A data tree structure is used for HS...
متن کاملRank structured matrices: theory, algorithms and applications
In numerical linear algebra much attention has been paid to matrices that are sparse, i.e., containing a lot of zeros. For example, to compute the eigenvalues of a general dense symmetric matrix, this matrix is first reduced to a similar tridiagonal one using an orthogonal similarity transformation. The subsequent QR-algorithm performed on this n×n tridiagonal matrix, takes the sparse structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2016
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1016679